An introduction to PL algorithms

نویسنده

  • Kurt Georg
چکیده

We give a brief introduction to piecewise linear (PL) algorithms, also called complementary pivot or fixed point algorithms. Our approach is based on the fundamental presentation of Eaves [14], hence we describe the algorithms in the general setting of PL manifolds. In particular, we introduce the PL homotopy method of Eaves & Saigal [16]. The recently established class of variable dimension algorithms will be presented. We use a particular cone construction for handling the homotopy parameter. Special attention is given to convergence results. Numerical details of the algorithms can only be sketched. For a more detailed presentation of such algorithms and bibliographical remarks we refer to [4].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Introduction to Differential Computation Analysis (DCA) on the withe-box cryptography algorithms

Advances in information and communication technologies lead to use of some new devices such as smart phones. The new devices provide more advantages for the adversaries hence with respect to them, one can define with-box cryptography. In this new model of cryptography, designers try to hide the key using as a kind of implementation. The Differential Computation Analysis (DCA) is a side channel ...

متن کامل

An Introduction to Inference and Learning in Bayesian Networks

Bayesian networks (BNs) are modern tools for modeling phenomena in dynamic and static systems and are used in different subjects such as disease diagnosis, weather forecasting, decision making and clustering. A BN is a graphical-probabilistic model which represents causal relations among random variables and consists of a directed acyclic graph and a set of conditional probabilities. Structure...

متن کامل

Bias-Variance Techniques for Monte Carlo Optimization: Cross-validation for the CE Method

In this paper, we examine the CE method in the broad context of Monte Carlo Optimization (MCO) [Ermoliev and Norkin, 1998, Robert and Casella, 2004] and Parametric Learning (PL), a type of machine learning. A well-known overarching principle used to improve the performance of many PL algorithms is the bias-variance tradeoff [Wolpert, 1997]. This tradeoff has been used to improve PL algorithms r...

متن کامل

Disaster Management in Scale-Free Networks: Recovery from and Protection Against Intentional Attacks

Susceptibility of scale free Power Law (PL) networks to attacks has been traditionally studied in the context of what may be termed as instantaneous attacks, where a randomly selected set of nodes and edges are deleted while the network is kept static. In this paper, we shift the focus to the study of progressive and instantaneous attacks on reactive grown and random PL networks, which can resp...

متن کامل

Remarks on Piecewise-linear Algebra

Introduction* A function f: V —>W between real vector spaces is piecewise-linear (PL) if there exists a partition of V into "open polyhedra" X€ (i.e., relative interiors of polyhedra) such that / is affine on each Xt. (As distinct to the case of PL-topology, no continuity is required of /.) Images and preimages under PL-maps give rise to finite unions of open polyhedra, or PL-seίs; conversely P...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989